المؤلفون: Andrew Ryzhikov

المساهمون: Université Paris-Est (UPE), Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout-Centre National de la Recherche Scientifique (CNRS), Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

المصدر: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2019, 787, pp.77-88. ⟨10.1016/j.tcs.2018.12.026⟩
CIAA 2017
CIAA 2017, Jun 2017, Paris, France. pp.188-200, ⟨10.1007/978-3-319-60134-2_16⟩
Implementation and Application of Automata ISBN: 9783319601335
CIAA

مصطلحات موضوعية: FOS: Computer and information sciences, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Computational complexity theory, General Computer Science, Formal Languages and Automata Theory (cs.FL), Timed automaton, Synchronizable set, Computer Science - Formal Languages and Automata Theory, 010103 numerical & computational mathematics, 0102 computer and information sciences, Computational Complexity (cs.CC), ω-automaton, 68Q17, 01 natural sciences, Theoretical Computer Science, Combinatorics, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Continuous spatial automaton, Quantum finite automata, 0101 mathematics, ComputingMilieux_MISCELLANEOUS, Directed acyclic word graph, Mathematics, Discrete mathematics, F.1.1, F.1.3, F.2.2, Subset rank, Nonlinear Sciences::Cellular Automata and Lattice Gases, Synchronizing automaton, Mobile automaton, Computational complexity, Computer Science - Computational Complexity, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Aperiodic graph, 010201 computation theory & mathematics, Computer Science::Formal Languages and Automata Theory, Inapproximability, Weakly acyclic automaton

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c2fbb935a32ca6bdc479d5fb11c79c8Test
https://doi.org/10.1016/j.tcs.2018.12.026Test

المؤلفون: Emmanuel Filiot, Raffaella Gentilini, Jean-Franà Sois Raskin

مصطلحات موضوعية: Automata Theory and Formal Languages, Computational Theory and Mathematics, Computer Science, Physical Sciences, Formal Methods in Software Verification and Control, Program Analysis and Verification Techniques, Artificial Intelligence, Synchronizing Automata, Realizability, Undecidable problem, Decidability, Discrete mathematics, Automaton, Computer science, Equivalence formal languages, ω-automaton, Mathematics, FOS Mathematics, Quantum finite automata, Automata theory, Combinatorics, Algorithm, Theoretical computer science

العلاقة: https://dx.doi.org/10.60692/9m18n-1cd95Test

الإتاحة: https://doi.org/10.60692/rje92-a572410.60692/9m18n-1cd95Test

المؤلفون: Jan Otop, Thomas A. Henzinger, Krishnendu Chatterjee

المصدر: LICS

مصطلحات موضوعية: FOS: Computer and information sciences, Discrete mathematics, Theoretical computer science, Nested word, TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Formal Languages and Automata Theory (cs.FL), GrowCut algorithm, Probabilistic logic, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, 02 engineering and technology, ω-automaton, Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Decidability, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Continuous spatial automaton, 0202 electrical engineering, electronic engineering, information engineering, Automata theory, Quantum finite automata, 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory, Mathematics

وصف الملف: application/pdf

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5563c581add96559c4aefd58a3bc0186Test
https://lmcs.episciences.org/4512Test

المؤلفون: Matthias Wendlandt, Martin Kutrib, Giovanni Pighizzini

المصدر: Information and Computation. 259:259-276

مصطلحات موضوعية: Discrete mathematics, 0102 computer and information sciences, 02 engineering and technology, ω-automaton, Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Computer Science Applications, Theoretical Computer Science, Combinatorics, Deterministic pushdown automaton, Deterministic finite automaton, Computational Theory and Mathematics, 010201 computation theory & mathematics, Deterministic automaton, 0202 electrical engineering, electronic engineering, information engineering, Automata theory, Quantum finite automata, 020201 artificial intelligence & image processing, Two-way deterministic finite automaton, Nondeterministic finite automaton, Computer Science::Formal Languages and Automata Theory, Information Systems, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::34043520d8761a86a03b2d1f21db63f4Test
https://doi.org/10.1016/j.ic.2017.09.005Test

المؤلفون: Nelma Moreira, Sabine Broda, Rogério Reis, António Machiavelo

المصدر: Information and Computation. 259:162-173

مصطلحات موضوعية: Discrete mathematics, Continuous automaton, Timed automaton, Büchi automaton, 0102 computer and information sciences, 02 engineering and technology, ω-automaton, Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Computer Science Applications, Theoretical Computer Science, Reversible cellular automaton, Combinatorics, Computational Theory and Mathematics, 010201 computation theory & mathematics, Deterministic automaton, Probabilistic automaton, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Nondeterministic finite automaton, Computer Science::Formal Languages and Automata Theory, Information Systems, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::c07bcdbbdabec88efaffabb238d9a283Test
https://doi.org/10.1016/j.ic.2017.08.013Test

المؤلفون: Ali Mohammad Saghiri, Mohammad Reza Meybodi

المصدر: Journal of Computational Science. 24:371-378

مصطلحات موضوعية: Theoretical computer science, General Computer Science, Learning automata, Computer science, 020206 networking & telecommunications, 02 engineering and technology, ω-automaton, Cellular automaton, Theoretical Computer Science, Mobile automaton, Stochastic cellular automaton, Modeling and Simulation, Continuous spatial automaton, 0202 electrical engineering, electronic engineering, information engineering, Automata theory, 020201 artificial intelligence & image processing, Asynchronous cellular automaton

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::1fa3a8bdf68aaa208b9fd1372ffbaf91Test
https://doi.org/10.1016/j.jocs.2017.08.015Test

المؤلفون: Yongming Li, Xiujuan Wei

المصدر: International Journal of Approximate Reasoning. 90:144-162

مصطلحات موضوعية: Discrete mathematics, Applied Mathematics, Büchi automaton, 020207 software engineering, Distributive lattice, 02 engineering and technology, ω-automaton, Fuzzy logic, Theoretical Computer Science, Nondeterministic algorithm, Closure (mathematics), Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Quantum finite automata, Automata theory, 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory, Software, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::0d1774569b1d8a141ca4efe83162a1c1Test
https://doi.org/10.1016/j.ijar.2017.07.007Test

المؤلفون: Sebastian Jakobi, Frank Drewes, Brink van der Merwe, Markus Holzer

المصدر: Fundamenta Informaticae. 155:89-110

مصطلحات موضوعية: Discrete mathematics, Algebra and Number Theory, Finite-state machine, Nested word, Computer science, 0102 computer and information sciences, 02 engineering and technology, ω-automaton, 01 natural sciences, Theoretical Computer Science, Deterministic finite automaton, State complexity, Computational Theory and Mathematics, 010201 computation theory & mathematics, Iterated function, 0202 electrical engineering, electronic engineering, information engineering, Quantum finite automata, 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory, Information Systems

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::515a2c6336ff47a4b2ef5706c8152be5Test
https://doi.org/10.3233/fi-2017-1577Test

المؤلفون: Martin Kutrib, Matthias Wendlandt

المصدر: Fundamenta Informaticae. 155:31-58

مصطلحات موضوعية: Discrete mathematics, Algebra and Number Theory, Linear bounded automaton, 0102 computer and information sciences, 02 engineering and technology, ω-automaton, Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, Cellular automaton, Theoretical Computer Science, Mobile automaton, Combinatorics, Computational Theory and Mathematics, Regular language, 010201 computation theory & mathematics, Continuous spatial automaton, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Programming Languages, Automata theory, Quantum finite automata, 020201 artificial intelligence & image processing, Computer Science::Formal Languages and Automata Theory, Information Systems, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::e640121e8f02856b78236cec18fd94f3Test
https://doi.org/10.3233/fi-2017-1575Test

المؤلفون: V. A. Molchanov, E. V. Khvorostukhina

المصدر: Lobachevskii Journal of Mathematics. 38:664-669

مصطلحات موضوعية: TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Mathematics::Combinatorics, Algebraic structure, General Mathematics, 010102 general mathematics, Timed automaton, ω-automaton, Characterization (mathematics), Nonlinear Sciences::Cellular Automata and Lattice Gases, 01 natural sciences, 010305 fluids & plasmas, Automaton, Algebra, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computer Science::Discrete Mathematics, 0103 physical sciences, Automata theory, Quantum finite automata, State (computer science), 0101 mathematics, Computer Science::Formal Languages and Automata Theory, MathematicsofComputing_DISCRETEMATHEMATICS, Mathematics

الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_________::444fc83b210d766de974792579f48fc9Test
https://doi.org/10.1134/s1995080217040114Test