article

Free access

Inference of Reversible Languages

Author:

Dana AngluinAuthors Info & Claims

Journal of the ACM (JACM), Volume 29, Issue 3

Pages 741 - 765

https://doi.org/10.1145/322326.322334

Published: 01 July 1982 Publication History

PDF eReader

References

[1]

AHO, A V, HOPCROFT, J E, AND ULLMAN, J D.The Design and Analysts of Computer .41gomhms Addtson-Weslcy, Reading, Mass, 1974

Crossref

Google Scholar

[2]

ANGLUIN, D On the complexity of rmnlmum inference of regular sets. Inf. Control 39 (1978), 337-350

Google Scholar

[3]

AnGLUIN, D Finding patterns common to a set of strings J Comput. Syst Sei. 21 (1980), 46--62.

Google Scholar

[4]

ANGLUIN, D Inductive reference of formal languages from posmve data Inf Control 45 (1980), 117-135

Google Scholar

[5]

BIER.MANN, A W, AND FELDMAN, J.A On the synthesis of finite-state machines from samples of their behavior IEEE Trans. Comput C-21 (1972), 592-597

Google Scholar

[6]

BLUM, L, AND BLUM, M.Toward a mathematic theory of inductive inference. Inf. Control 28 (1978), 125-155.

Google Scholar

[7]

CASE, J., AND SMITH, C Anomaly hlerarclues of mechamzed inductive reference. Proc. 10th ACM Symp on Theory of Computing, San DLego, Calif., 1978, pp 314-319.

Crossref

Google Scholar

[8]

Cohen, R.S, AND BRZOEOWSKI, J A.General propemes of star height of regular events. J Comput. Syst. Sct 4 (1970), 260-280.

Google Scholar

[9]

CRESPI-RegHIZZI, S An effective model for grammar inference. In Informatwn Processing, North Holland, 1972, pp 524-529

Google Scholar

[10]

CRESPI-R_EGHIZZI, S, GuID^, G, ANt) MANDRIOLI, D Noncountmg context-free languages, d. A CM 25,4 (Oct. 1978), 571-580.

Crossref

Google Scholar

[11]

FELDMAN, J.A First thoughts on grammatical inference Tech, Rep., Artificial Intelhgence Project, Stanford Un,v., Stanford, Calif., 1967

Google Scholar

[12]

FELDMAN, J A Some decldabdlty results m grammaucal inference Inf. Control 20 (1972), 244-262,

Google Scholar

[13]

FELDMAN, J.A., GIPS, J., HOgNINO, J.J., AND REDER, S Grammatical complexity and reference Tech Rep, Computer Scmnce Dep., Stanford Unlv, Stanford, Cahf, 1969.

Crossref

Google Scholar

[14]

Fu,KS Syntactic Methods m Pattern Recognltwn Academic Press, New York, I975.

Google Scholar

[15]

Fu,K S Syntacac Pattern RecogniOon, Apphcations Spnnger-Veflag, New York, 1977.

Google Scholar

[16]

Fu, K S, AND BOOTH, T.L. Grammatical mference" Introduction and survey, Parts 1 and 2 IEEE Trans. Syst., Man Cybern SMC-5 (1975), 95-11.1,409-423.

Google Scholar

[17]

GINZBURG, A.About some properties of definite, reverse-defimte and related automata. IEEE Trans Electron. Comput. EC-15 (1966), 806-810

Google Scholar

[18]

GOLD, E M Language identification m the lmalt lnf Control 10 (1967), 447--474

Google Scholar

[19]

GOLD, E.M.Complexity of automaton identification from given data lnf Control 37 (1978), 302-320

Google Scholar

[20]

GONZAL~Z, R.C, AND TltOMASON, M.G.Syntacnc Pattern Recogmtwn, An Introducoon. Addison- Wesley, Reading, Mass, 1978.

Google Scholar

[21]

HARRISON, M.A Introducnon to Swttchmg and Automata Theory. McGraw-i-hU, New York. 1965

Google Scholar

[22]

HARRISON, M.A.Introduction to Formal Language Theory Addison-Wesley, Reading, Mass, 1978.

Crossref

Google Scholar

[23]

HARTMANIS, J., AND STEARNS, R.E A lgebrmc Theory of Sequennal Machines Prentice-Hall, EAglewood Cliffs, N J, 1966

Google Scholar

[24]

HOPCROFT, J E, AND ULLMAN, J.D Introduction to A utomata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass, 1979.

Crossref

Google Scholar

[25]

ITOGA, S Y. A new heuristic for inferring regular grammars. IEEE Trans Pattern Anal Mach. lntelL PAMI-3 (1981), 191-197,

Google Scholar

[26]

MCNAUGHTON, R.The loop complexity of pure-group events, lnf Control 11 (1967), 167-176

Google Scholar

[27]

MCNAUGIITON, R Parenthes,s grammars J ACM 14. 3 (July 1967), 490--500

Crossref

Google Scholar

[28]

MCNAUGHTON, R, AND PAPERT, S Counter-Free Automata M.I T Press, Cambridge, Mass., 1971.

Crossref

Google Scholar

[29]

MICLET, L.Regular mferenees with a tad-clustenng method IEEE Trans Syst. Man Cybern. SMC- 10 (1980), 737-743

Google Scholar

[30]

PERLES, M, RAB1/q, M.O, AND SHAMIR, E.The theory of definite automata, IEEE Trans. Electron Comput EC-12 (1963), 233-243

Google Scholar

[31]

SMITH, C.H An inductive,nference blbhography Tech Rep CSD TR 323, Computer Science Dep., Purdue Unw, Lafayette, Ind, 1979

Google Scholar

[32]

TARJAN, R E Efficiency of a good but not linear set union algorithm d A CM 22, 2 (Apr 1975), 215-225

Crossref

Google Scholar

[33]

ZALCSTEIN, Y Locally testable languages J. Comput. Syst. Sct 6 (1972), 151-167

Google Scholar

Cited By

View all

Putnik GPetrovic PShah V(2024)Spatial Visual Feedback for Robotic Arc-Welding Enforced by Inductive Machine LearningJournal of Manufacturing Science and Engineering10.1115/1.4064156146:4Online publication date: 28-Feb-2024
https://doi.org/10.1115/1.4064156
Kutrib MMalcher A(2024)Reversible Computations of One-Way Counter AutomataRAIRO - Theoretical Informatics and Applications10.1051/ita/202301158(5)Online publication date: 15-Mar-2024
https://doi.org/10.1051/ita/2023011
Slaats TDebois SBack CChristfort A(2024)Foundations and practice of binary process discoveryInformation Systems10.1016/j.is.2023.102339121(102339)Online publication date: Mar-2024
https://doi.org/10.1016/j.is.2023.102339
Show More Cited By

Index Terms

Inference of Reversible Languages
1. Computing methodologies
  1. Machine learning
    1. Machine learning approaches
      1. Logical and relational learning
        Inductive logic learning
2. Theory of computation
  1. Formal languages and automata theory
    1. Grammars and context-free languages

Recommendations

Languages as libraries
PLDI '11

Programming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...
Languages as libraries
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation

Programming language design benefits from constructs for extending the syntax and semantics of a host language. While C's string-based macros empower programmers to introduce notational shorthands, the parser-level macros of Lisp encourage ...
Approximate inference for first-order probabilistic languages
IJCAI'01: Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete possible worlds underlying any given knowledge base. The simplicity of the ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 29, Issue 3

July 1982

302 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322326

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1982

Published in JACM Volume 29, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

416
Total Citations
View Citations
1,822
Total Downloads

Downloads (Last 12 months)245
Downloads (Last 6 weeks)24

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Putnik GPetrovic PShah V(2024)Spatial Visual Feedback for Robotic Arc-Welding Enforced by Inductive Machine LearningJournal of Manufacturing Science and Engineering10.1115/1.4064156146:4Online publication date: 28-Feb-2024
https://doi.org/10.1115/1.4064156
Kutrib MMalcher A(2024)Reversible Computations of One-Way Counter AutomataRAIRO - Theoretical Informatics and Applications10.1051/ita/202301158(5)Online publication date: 15-Mar-2024
https://doi.org/10.1051/ita/2023011
Slaats TDebois SBack CChristfort A(2024)Foundations and practice of binary process discoveryInformation Systems10.1016/j.is.2023.102339121(102339)Online publication date: Mar-2024
https://doi.org/10.1016/j.is.2023.102339
Radionova MOkhotin A(2024)Decision Problems for Reversible and Permutation AutomataImplementation and Application of Automata10.1007/978-3-031-71112-1_22(302-315)Online publication date: 3-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-71112-1_22
Kutrib MMalcher A(2023)Reversible Two-Party ComputationsElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.386.12386(142-154)Online publication date: 3-Sep-2023
https://doi.org/10.4204/EPTCS.386.12
Qiu D(2023)Learning quantum finite automata with queriesMathematical Structures in Computer Science10.1017/S0960129523000373(1-19)Online publication date: 30-Nov-2023
https://doi.org/10.1017/S0960129523000373
Kostolányi P(2023)Bideterministic weighted automataInformation and Computation10.1016/j.ic.2023.105093295(105093)Online publication date: Dec-2023
https://doi.org/10.1016/j.ic.2023.105093
Gruber HHolzer MRauch C(2023)The Pumping Lemma for Regular Languages is HardImplementation and Application of Automata10.1007/978-3-031-40247-0_9(128-140)Online publication date: 19-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-40247-0_9
Kutrib MMalcher A(2022)Reversible Computations of One-Way Counter AutomataElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.367.9367(126-142)Online publication date: 27-Aug-2022
https://doi.org/10.4204/EPTCS.367.9
Kutrib MMeyer U(2022)Reversible Top-Down Syntax AnalysisInternational Journal of Foundations of Computer Science10.1142/S012905412244004X34:02n03(225-251)Online publication date: 16-Nov-2022
https://doi.org/10.1142/S012905412244004X
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Languages as libraries

Languages as libraries

Approximate inference for first-order probabilistic languages

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations