Article

Learning Stochastic Regular Grammars by Means of a State Merging Method

Authors:

Rafael C. Carrasco,

José OncinaAuthors Info & Claims

ICGI '94: Proceedings of the Second International Colloquium on Grammatical Inference and Applications

Pages 139 - 152

Published: 21 September 1994 Publication History

Abstract

No abstract available.

Cited By

View all

Grachev P(2019)Grammar Inference Based on Passive Learning and Genetic AlgorithmProceedings of the 3rd International Conference on Machine Learning and Soft Computing10.1145/3310986.3311033(87-92)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3310986.3311033
Tappler MAichernig BBacci GEichlseder MLarsen K(2019)-Based Learning of Markov Decision ProcessesFormal Methods – The Next 30 Years10.1007/978-3-030-30942-8_38(651-669)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-30942-8_38
Wang JSun JYuan QPang J(2018)Learning probabilistic models for model checkingInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3288063.328807920:6(689-704)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.5555/3288063.3288079
Show More Cited By

Learning Stochastic Regular Grammars by Means of a State Merging Method
1. Theory of computation
  1. Formal languages and automata theory

Recommendations

Stochastic context-free grammars, regular languages, and newton's method
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

We study the problem of computing the probability that a given stochastic context-free grammar (SCFG), G, generates a string in a given regular language L(D) (given by a DFA, D). This basic problem has a number of applications in statistical natural ...
Stochastic lexicalized tree-adjoining grammars
COLING '92: Proceedings of the 14th conference on Computational linguistics - Volume 2

The notion of stochastic lexicalized tree-adjoining grammar (SLTAG) is formally defined. The parameters of a SLTAG correspond to the probability of combining two structures each one associated with a word. The characteristics of SLTAG are unique and ...
Regular right part grammars and their parsers

This paper introduces an alternative to context-free grammars called regular right part (RRP) grammars, which resemble PASCAL syntax diagrams. Formally, RRP grammars have production right parts, which are nondeterministic finite state machines (FSMs), ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ICGI '94: Proceedings of the Second International Colloquium on Grammatical Inference and Applications

September 1994

290 pages

ISBN:3540584730

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 21 September 1994

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

63
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Grachev P(2019)Grammar Inference Based on Passive Learning and Genetic AlgorithmProceedings of the 3rd International Conference on Machine Learning and Soft Computing10.1145/3310986.3311033(87-92)Online publication date: 25-Jan-2019
https://dl.acm.org/doi/10.1145/3310986.3311033
Tappler MAichernig BBacci GEichlseder MLarsen K(2019)-Based Learning of Markov Decision ProcessesFormal Methods – The Next 30 Years10.1007/978-3-030-30942-8_38(651-669)Online publication date: 7-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-30942-8_38
Wang JSun JYuan QPang J(2018)Learning probabilistic models for model checkingInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3288063.328807920:6(689-704)Online publication date: 1-Nov-2018
https://dl.acm.org/doi/10.5555/3288063.3288079
Li CCheung WLiu JNg J(2018)Automatic Extraction of Behavioral Patterns for Elderly Mobility and Daily Routine AnalysisACM Transactions on Intelligent Systems and Technology10.1145/31781169:5(1-26)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1145/3178116
Wang JSun JYuan QPang J(2017)Should We Learn Probabilistic Models for Model Checking? A New Approach and An Empirical StudyProceedings of the 20th International Conference on Fundamental Approaches to Software Engineering - Volume 1020210.1007/978-3-662-54494-5_1(3-21)Online publication date: 22-Apr-2017
https://dl.acm.org/doi/10.1007/978-3-662-54494-5_1
Beschastnikh IBrun YAbrahamson JErnst MKrishnamurthy A(2015)Using Declarative Specification to Improve the Understanding, Extensibility, and Comparison of Model-Inference AlgorithmsIEEE Transactions on Software Engineering10.1109/TSE.2014.236904741:4(408-428)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1109/TSE.2014.2369047
Beschastnikh IBrun YAbrahamson JErnst MKrishnamurthy ANotkin DCheng BPohl K(2013)Unifying FSM-inference algorithms through declarative specificationProceedings of the 2013 International Conference on Software Engineering10.5555/2486788.2486822(252-261)Online publication date: 18-May-2013
https://dl.acm.org/doi/10.5555/2486788.2486822
Kwon YAgha G(2013)Performance evaluation of sensor networks by statistical modeling and euclidean model checkingACM Transactions on Sensor Networks10.1145/2489253.24892569:4(1-38)Online publication date: 23-Jul-2013
https://dl.acm.org/doi/10.1145/2489253.2489256
Wen YRay APhoha S(2013)Hilbert space formulation of symbolic systems for signal representation and analysisSignal Processing10.1016/j.sigpro.2013.02.00293:9(2594-2611)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.sigpro.2013.02.002
Biedrzycki RArabas J(2012)KISInternational Journal of Applied Mathematics and Computer Science10.5555/3063108.306311522:3(711-721)Online publication date: 1-Sep-2012
https://dl.acm.org/doi/10.5555/3063108.3063115
Show More Cited By

Abstract

Cited By

Recommendations

Stochastic context-free grammars, regular languages, and newton's method

Stochastic lexicalized tree-adjoining grammars

Regular right part grammars and their parsers

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations